Optimal Testing for Planted Satisfiability Problems
نویسنده
چکیده
We study the problem of detecting planted solutions in a random satisfiability formula. Adopting the formalism of hypothesis testing in statistical analysis, we describe the minimax optimal rates. We also address algorithmic issues, and describe the performance of a new computationally efficient test. This result is compared to a related hypothesis on the hardness of detecting satisfiability of random formulas. AMS 2000 subject classifications: Primary 62C20; secondary 68R01, 60C05.
منابع مشابه
Detection of Planted Solutions for Flat Satisfiability Problems
We study the detection problem of finding planted solutions in random instances of flat satisfiability problems, a generalization of boolean satisfiability formulas. We describe the properties of random instances of flat satisfiability, as well of the optimal rates of detection of the associated hypothesis testing problem. We also study the performance of an algorithmically efficient testing pr...
متن کاملConditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
This paper studies a class of probabilistic models on graphs, where edge variables depend on incident node variables through a fixed probability kernel. The class includes planted constraint satisfaction problems (CSPs), as well as more general structures motivated by coding and community clustering problems. It is shown that under mild assumptions on the kernel and for sparse random graphs, th...
متن کاملConditional Random Fields, Planted Satisfaction, and Entropy Concentration
This paper studies a class of probabilistic models on graphs, where edge variables depend on incident node variables through a fixed probability kernel. The class includes planted constraint satisfaction problems (CSPs), as well as more general structures motivated by coding and community clustering problems. It is shown that under mild assumptions on the kernel, the conditional entropy of the ...
متن کاملSharp Computational-Statistical Phase Transitions via Oracle Computational Model
We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound that explicitly connects the minimum testing risk under computational budget con...
متن کاملPhase Transition for Local Search on Planted SAT
The Local Search algorithm (or Hill Climbing, or Iterative Improvement) is one of the simplest heuristics to solve the Satisfiability and Max-Satisfiability problems. Although it is not the best known Satisfiability algorithm even for the class of problems we study, the Local search is a part of many satisfiability and max-satisfiability solvers, where it is used to find a good starting point f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1401.2205 شماره
صفحات -
تاریخ انتشار 2014